The Subgraph Bisimulation Problem and its Complexity
نویسندگان
چکیده
In this paper we study the complexity of the Subgraph Bisimulation Problem, which stands to graph bisimulation as subgraph isomorphism stands to graph isomorphism, and we prove its NP-completeness. Our analysis is motivated by recent requirements coming from semistructured databases, where Subgraph Bisimulation can be used for retrieving semistructured data, even in presence of ‘cyclic’ queries and instances. The problem could be interesting also for the concurrency research area, where bisimulation is the main tool for describing process equivalence, and in the model checking area, where bisimulation serves as a means to reduce state explosion.
منابع مشابه
The Subgraph Bisimulation Problem
We study the complexity of the Subgraph Bisimulation Problem, which stands to Graph Bisimulation as Subgraph Isomorphism stands to Graph Isomorphism and we prove its NP-Completeness. Our analysis is motivated by its applications to Semistructured Databases.
متن کاملBisimulation for BL-general fuzzy automata
In this note, we define bisimulation for BL-general fuzzy automata and show that if there is a bisimulation between two BL-general fuzzy automata, then they have the same behavior.For a given BL-general fuzzy automata, we obtain the greatest bisimulation for the BL-general fuzzy automata. Thereafter, if we use the greatest bisimulation, then we obtain a quotient BL-general fuzzy automata and th...
متن کاملUnderstanding the Complexity of Induced Subgraph Isomorphisms
We study left-hand side restrictions of the induced subgraph isomorphism problem: Fixing a class C, for given graphs G ∈ C and arbitrary H we ask for induced subgraphs of H isomorphic to G. For the homomorphism problem this kind of restriction has been studied by Grohe and Dalmau, Kolaitis and Vardi for the decision problem and by Dalmau and Jonsson for its counting variant. We give a dichotomy...
متن کاملLong Circuits and Large Euler Subgraphs
An undirected graph is Eulerian if it is connected and all its vertices are of even degree. Similarly, a directed graph is Eulerian, if for each vertex its in-degree is equal to its out-degree. It is well known that Eulerian graphs can be recognized in polynomial time while the problems of finding a maximum Eulerian subgraph or a maximum induced Eulerian subgraph are NP-hard. In this paper, we ...
متن کاملA Unified Framework for Strengthening Topological Node Features and Its Application to Subgraph Isomorphism Detection
This paper presents techniques to address the complexity problem of subgraph isomorphism detection on large graphs. To overcome the inherently high computational complexity, the problem is simplified through the calculation and strengthening of topological node features. These features can be utilised, in principle, by any subgraph isomorphism algorithm. The design and capabilities of the propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002